Weak sense Lp error bounds for leader-node distributed particle filters

نویسندگان

  • Boris N. Oreshkin
  • Mark Coates
چکیده

The leader node particle filter is a partially distributed approach to tracking in a sensor network, in which the node performing the particle filter computations (the leader node) changes over time. The primary advantage is that the position of the leader node can follow the target, improving the efficiency of data collection. When the leader node changes, the particle filter must be communicated to the new leader. Exchanging a complete representation can require many thousands of bits, so the filtering distribution is more coarsely approximated, either by transmitting only a subset of particles or by training a parametric model. The concern is that this approximation could lead to instability and eventually tracking failure. The major contribution of this paper is the development of bounds on the error of the leader node particle filter. In contrast to previous bounds, which grow exponentially over time, the bounds indicate convergent behaviour.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of error propagation in particle filters with approximation

This paper examines the impact of approximation steps that become necessary when particle filters are implemented on resource-constrained platforms. We consider particle filters that perform intermittent approximation, either by subsampling the particles or by generating a parametric approximation. For such algorithms, we derive time-uniform bounds on the weak-sense Lp error and present associa...

متن کامل

Algorithms and Lp-duality Based Lower Bounds in Ad-hoc Radio Networks by Rohan Jude Fernandes

OF THE DISSERTATION Algorithms and LP-Duality Based Lower Bounds in Ad-hoc Radio Networks by Rohan Jude Fernandes Dissertation Director: Mart́ın Farach-Colton An Ad-hoc Radio Network consists of nodes with no knowledge of its neighbors and knowledge of its own ID and n, the size of the network. In this thesis, we present algorithms and lower bounds related to ad-hoc network initialization. Senso...

متن کامل

Distributed Bayesian Fault diagnosis in Collaborative Wireless Sensor Networks

In this contribution, we propose an efficient collaborative strategy for online change detection, in a distributed sensor network. The collaborative strategy ensures the efficiency and the robustness of the data processing, while limiting the required communication bandwith. The observed systems are assumed to have each a finite set of states, including the abrupt change behavior. For each disc...

متن کامل

Sublinear Bounds for Randomized Leader Election

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) uses only O( √ n log n) messages to elect a unique leader (with high probability). When considering the “explicit” variant of leader election where eventually every node knows th...

متن کامل

Tracking and identification of regime-switching systems using binary sensors

This work is concerned with tracking and system identification for time-varying parameters. The parameters areMarkov chains and the observations are binary valuedwith noise corruption. To overcome the difficulties due to the limited measurement information, Wonham-type filters are developed first. Then, based on the filters, two popular estimators, namely, mean squares estimator (MSQ) andmaximu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008